New decomposition methods for solving variational inequality problems
نویسندگان
چکیده
منابع مشابه
A Survey of Direct Methods for Solving Variational Problems
This study presents a comparative survey of direct methods for solving Variational Problems. Thisproblems can be used to solve various differential equations in physics and chemistry like RateEquation for a chemical reaction. There are procedures that any type of a differential equation isconvertible to a variational problem. Therefore finding the solution of a differential equation isequivalen...
متن کاملAugmented Lagrangian methods for variational inequality problems
We introduce augmented Lagrangian methods for solving finite dimensional variational inequality problems whose feasible sets are defined by convex inequalities, generalizing the proximal augmented Lagrangian method for constrained optimization. At each iteration, primal variables are updated by solving an unconstrained variational inequality problem, and then dual variables are updated through ...
متن کاملa survey of direct methods for solving variational problems
this study presents a comparative survey of direct methods for solving variational problems. thisproblems can be used to solve various differential equations in physics and chemistry like rateequation for a chemical reaction. there are procedures that any type of a differential equation isconvertible to a variational problem. therefore finding the solution of a differential equation isequivalen...
متن کاملA class of Dantzig-Wolfe type decomposition methods for variational inequality problems
We consider a class of decomposition methods for variational inequalities, which is related to the classical Dantzig–Wolfe decomposition of linear programs. Our approach is rather general, in that it can be used with certain types of set-valued or nonmonotone operators, as well as with various kinds of approximations in the subproblems of the functions and derivatives in the single-valued case....
متن کاملA Proximal Decomposition Method for Solving Convex Variational Inverse Problems
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of nonsmooth functions and establish its convergence. The algorithm fully decomposes the problem in that it involves each function individually via its own proxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2003
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(03)00016-5